Myer Bloom

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bloom filters

Bloom filters are used for answering queries on set membership. In this data structure, the whole element is not stored at the hashed address. Only a few bits are set in an array. Given a set S of cardinality n, we store it in an array of m bits using k hash functions h1(), . . . , hk(). Initially, all the cells in the array are set to 0. Then, for each element in the set, x ∈ S, for each 1 ≤ i...

متن کامل

Kerry Bloom

DNA, as all molecules in the cell, is constantly agitated through thermal energy and bombardment from water and neighboring masses. Through super-resolution tracking of DNA in live cells and simulation of the statistical mechanics of polymers we are building intuition into the function of DNA loops. We have discovered that the normal kinetics of replication fork progression allows time for ther...

متن کامل

Peter Bloom

How capitalist organizations ensure the obedience of its members has long been a matter of discussion. Behind the idealism of “market freedom” lie more troubling realities of daily subordination and ideologies of conformity. Increasingly scholars have studied the effect of subjugating subjectivities present in capitalist production. Two specific features of modern capitalism have been the utili...

متن کامل

Bloom Maps

We consider the problem of succinctly encoding a static map to support approximate queries. We derive upper and lower bounds on the space requirements in terms of the error rate and the entropy of the distribution of values over keys: our bounds differ by a factor log e. For the upper bound we introduce a novel data structure, the Bloom map, generalising the Bloom filter to this problem. The lo...

متن کامل

The Gaussian Bloom Filter

Modern databases tailored to highly distributed, fault tolerant management of information for big data applications exploit a classical data structure for reducing disk and network I/O as well as for managing data distribution: The Bloom filter. This data structure allows to encode small sets of elements, typically the keys in a key-value store, into a small, constant-size data structure. In or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Today

سال: 2016

ISSN: 0031-9228,1945-0699

DOI: 10.1063/pt.3.3206